Stochastic Cellular Automata Solutions to the Density Classification Problem
نویسندگان
چکیده
منابع مشابه
Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision
The density classification problem consists in using a binary cellular automaton (CA) to decide whether an initial configuration contains more 0s or 1s. This problem is known for having no exact solution in the case of binary, deterministic, one-dimensional CA. Stochastic cellular automata have been studied as an alternative for solving the problem. This paper is aimed at presenting techniques ...
متن کاملSolutions on 1-D and 2-D Density Classification Problem Using Programmable Cellular Automata
This paper presents solutions to Density Classification Task (DCT) using a variant of Cellular Automata (CA) called Programmable Cellular Automata (PCA). The translation property as well as the density preserving property of fundamental CA rules in 1D and 2D, and the advantage of PCA are embedded together to obtain the DCT solution. The advantage of PCA over standard CA is reported. A general 2...
متن کاملEvolving Asynchronous Cellular Automata for Density Classification
This paper presents the comparative results of applying the same genetic algorithm (GA) for the evolution of both synchronous and randomly updated asynchronous cellular automata (CA) for the computationally emergent task of density classification. The present results indicate not only that these asynchronous CA evolve more quickly and consistently than their synchronous counterparts, but also t...
متن کاملUniform Coevolution for solving the density classification problem in Cellular Automata
Uniform Coevolution is based on competitive evolution ideas where the solution and example sets are evolving by means of a competition to generate difficult test beds for the solutions in a gradual way. The method has been tested with the density parity problem in cellular automata, where the selected examples can biased the solutions founded. The results show a high value of generality using U...
متن کاملConceptual Structure in Cellular Automata - The Density Classification Task
The notion of conceptual structure in cellular automata (CA) rules that perform the density classification task (DCT) was introduced by Marques-Pita et al. (2006). Here we investigate the role of process-symmetry in CAs that solve the DCT, in particular the idea of conceptual similarity, which defines a novel search space for CA rules. We report on two new highest-performing process symmetric r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2012
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-012-9386-3